package Sep.BSTAncestor;

public class FiveTree {
    
}

// 235. 二叉搜索树的最近公共祖先
class TreeNode {
      int val;
      TreeNode left;
      TreeNode right;
      TreeNode(int x) { val = x; }
  }
 

class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if((root.val>p.val&&root.val<q.val)||(root.val<p.val&&root.val>q.val)||
                        root.val==p.val||root.val==q.val)return root;
        if(root.val>p.val) return lowestCommonAncestor(root.left, p, q);
        return lowestCommonAncestor(root.right, p, q);
    }
}
